Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results
نویسندگان
چکیده
We present an extension EL ⊥ T of the description logic EL ⊥ for reasoning about prototypical properties and inheritance with exceptions. EL ⊥ T is obtained by adding to EL ⊥ a typicality operator T, which is intended to select the “typical” instances of a concept. In EL ⊥ T knowledge bases may contain inclusions of the form “T(C) is subsumed by P”, expressing that typical C-members have the property P . We show that the problem of entailment in EL ⊥ T is in co-NP.
منابع مشابه
Reasoning about typicality with low complexity Description Logics: the logic EL
We present an extension of the low complexity Description Logic EL ⊥ for reasoning about prototypical properties and inheritance with exceptions. We add to EL ⊥ a typicality operator T, which is intended to select the “most normal” instances of a concept. In the resulting logic, called EL ⊥ T, the knowledge base may contain subsumption relations of the form “T(C) is subsumed by P”, expressing t...
متن کاملReasoning about Typicality with Low Complexity Description Logics: The Logic EL+^T
We present an extension of the low complexity Description Logic EL+ for reasoning about prototypical properties and inheritance with exceptions. We add to EL+ a typicality operator T, which is intended to select the “most normal” instances of a concept. In the resulting logic, called EL+T, the knowledge base may contain subsumption relations of the form “T(C) is subsumed by P”, expressing that ...
متن کاملTask Complexity Manipulation and Accuracy in Writing Performance
This study aimed to investigate the impact of task sequencing, along +/- reasoning demands dimension, on writing task performance in terms of accuracy. The study was motivated by Robinson’s Cognition Hypothesis (CH) as well as previous studies investigating the relationships between task complexity and second language production. The participants of the study were 90 intermediate students at t...
متن کاملReasoning About Typicality in ALC and EL
In this work we summarize our recent results on extending Description Logics for reasoning about prototypical properties and inheritance with exceptions. First, we focus our attention on the logic ALC. We present a nonmonotonic logic ALC + Tmin, which is built upon a monotonic logic ALC+T obtained by adding a typicality operator T to ALC. The operator T is intended to select the “most normal” o...
متن کاملNot Too Big, Not Too Small... Complexities of Fixed-Domain Reasoning in First-Order and Description Logics
We consider reasoning problems in description logics and variants of first-order logic under the fixed-domain semantics, where the model size is finite and explicitly given. It follows from previous results that standard reasoning is NP-complete for a very wide range of logics, if the domain size is given in unary encoding. In this paper, we complete the complexity overview for unary encoding a...
متن کامل